Dynamic Shapes of Arbitrary Dimension: The Vector Distance Functions

نویسندگان

  • Olivier D. Faugeras
  • José Gomes
چکیده

We present a novel method for representing and evolving objects of arbitrary dimension. The method, called the Vector Distance Function (VDF) method, uses the vector that connects any point in space to its closest point on the object. It can deal with smooth manifolds with and without boundaries and with shapes of diierent dimensions. It can be used to evolve such objects according to a variety of motions, including mean curvature. If discontinuous velocity elds are allowed the dimension of the objects can change. The evolution method that we propose guarantees that we stay in the class of VDFs and therefore that the intrinsic properties of the underlying shapes such as their dimension, curvatures can be read oo easily from the VDF and its spatial derivatives at each time instant. The main disadvantage of the method is its redundancy: the size of the representation is always that of the ambient space even though the object we are representing may be of a much lower dimension. This disadvantage is also one of its strengths since it buys us exibility.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

hypersurfaces: The vector distance functions

We present a novel method for representing and evolving objects of arbitrary dimension. The method, called the Vector Distance Function (VDF) method, uses the vector that connects any point in space to its closest point on the object. It can deal with smooth manifolds with and without boundaries and with shapes of diierent dimensions. It can be used to evolve such objects according to a variety...

متن کامل

An Efficient Numerical Algorithm For Solving Linear Differential Equations of Arbitrary Order And Coefficients

Referring to one of the recent works of the authors, presented in~cite{differentialbpf}, for numerical solution of linear differential equations, an alternative scheme is proposed in this article to considerably improve the accuracy and efficiency. For this purpose, triangular functions as a set of orthogonal functions are used. By using a special representation of the vector forms of triangula...

متن کامل

Fast and accurate approximation of digital shape thickness distribution in arbitrary dimension

We present a fast and accurate approximation of the Euclidean thickness distribution computation of a binary shape in arbitrary dimension. Thickness functions associate a value representing the local thickness for each point of a binary shape. When considering with the Euclidean metric, a simple definition is to associate with each point x, the radius of the largest ball inscribed in the shape ...

متن کامل

Analytical Solution for a Two-Layer Transversely Isotropic Half-Space Affected by an Arbitrary Shape Dynamic Surface Load

The dynamic response of a transversely isotropic, linearly elastic layer bonded to the surface of a half-space of a different transversely isotropic material under arbitrary shape surface loads is considered. With the help of displacements and stresses Green’s functions, an analytical formulation is presented for the determination of the displacements and stresses at any point in both surface l...

متن کامل

Matching and recognition of planar shapes using medial axis properties

Using the geometrical properties of medial axis of closed planar shapes, we propose a shape representation called chain of circles (CoCs), and show its use for shape matching and recognition. CoCs is directly extracted from a resulting axial con guration of shapes along boundary curves without any intermediate description like graph obtained from segmenting shapes, and has the form of vector, e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000